Coalition structure generation in multi-agent systems with mixed externalities
نویسندگان
چکیده
Coalition structure generation (CSG) for multi-agent systems is a well-studied problem. A vast majority of the previous work and the state-of-the-art approaches to CSG assume a characteristic function form of the coalition values, where a coalition’s value is independent of the other coalitions in the coalition structure. Recently, there has been interest in the more realistic partition function form of coalition values, where the value of a coalition is affected by how the other agents are partitioned, via externalities. We argue that in domains with externalities, a distributed/adaptive approach to CSG may be impractical, and that a centralized approach to CSG is more suitable. However, the most recent studies in this direction have focused on cases where all externalities are either always positive or always negative, and results on coalition structure generation in more general settings (in particular, mixed externalities) are lacking. In this paper we propose a framework based on agenttypes that incorporates mixed externalities and demonstrate that it includes the previous settings as special cases. We also generalize some previous results in anytime CSG, showing that those results are again special cases. In particular, we extend the existing branch and bound algorithm to this new setting and show empirically that significant pruning can be achieved when searching for the optimal coalition structure. This extends the state-of-the-art in CSG for multi-agent systems.
منابع مشابه
Coalition Structure Generation in Multi-Agent Systems with Positive and Negative Externalities
Coalition structure generation has received considerable attention in recent research. Several algorithms have been proposed to solve this problem in Characteristic Function Games (CFGs), where every coalition is assumed to perform equally well in any coalition structure containing it. In contrast, very little attention has been given to the more general Partition Function Games (PFGs), where a...
متن کاملExtension of MC-net-based coalition structure generation: handling negative rules and externalities
Forming effective coalitions is a major research challenge in AI and multi-agent systems. A Coalition Structure Generation (CSG) problem involves partitioning a set of agents into coalitions so that the social surplus is maximized. Ohta et al. introduce an innovative direction for solving CSG, i.e., by representing a characteristic function as a set of rules, a CSG problem can be formalized as ...
متن کاملAnytime coalition structure generation in multi-agent systems with positive or negative externalities
Article history: Received 2 February 2011 Received in revised form 29 October 2011 Accepted 17 March 2012 Available online 29 March 2012
متن کاملOptimal Coalition Structure Generation In Partition Function Games
1 In multi-agent systems (MAS), coalition formation is typically studied using characteristic function game (CFG) representations, where the performance of any coalition is independent from co-existing coalitions in the system. However, in a number of environments, there are significant externalities from coalition formation where the effectiveness of one coalition may be affected by the format...
متن کاملTackling the computational complexity of understanding coalition formation in multi-agent systems
Tackling the Computational Complexity of Understanding Coalition Formation in Multi-agent Systems, Andrew Dowell In its simplest metaphor, agent based computation is that undertaken via the interactions of autonomous computational entities (from [39]). Often, these interactions are cooperative and, in this context, a coalition describes any group of agents who may cooperate together. In any mul...
متن کامل